A sparse fast Fourier algorithm for real non-negative vectors
نویسندگان
چکیده
منابع مشابه
Sparse 2D Fast Fourier Transform
This paper extends the concepts of the Sparse Fast Fourier Transform (sFFT) Algorithm introduced in [1] to work with two dimensional (2D) data. The 2D algorithm requires several generalizations to multiple key concepts of the 1D sparse Fourier transform algorithm. Furthermore, several parameters needed in the algorithm are optimized for the reconstruction of sparse image spectra. This paper add...
متن کاملA Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods
The standard compressive sensing (CS) aims to recover sparse signal from single measurement vector which is known as SMV model. By contrast, recovery of sparse signals from multiple measurement vectors is called MMV model. In this paper, we consider the recovery of jointly sparse signals in the MMV model where multiple signal measurements are represented as a matrix and the sparsity of signal o...
متن کاملA Fast Algorithm for Sparse Controller Design
We consider the task of designing sparse control laws for large-scale systems by directly minimizing an infinite horizon quadratic cost with an `1 penalty on the feedback controller gains. Our focus is on an improved algorithm that allows us to scale to large systems (i.e. those where sparsity is most useful) with convergence times that are several orders of magnitude faster than existing algor...
متن کاملA sparse multidimensional FFT for real positive vectors
We present a sparse multidimensional FFT randomized algorithm (sMFFT) for positive real vectors. The algorithm works in any fixed dimension, requires an (almost)-optimal number of samples (O R log N R) and runs in O R log(R) log N R complexity (where N is the size of the vector and R the number of nonzeros). It is stable to noise and exhibits an exponentially small probability of failure.
متن کاملHigh Performance Sparse Fast Fourier Transform
The Sparse Fast Fourier Transform is a recent algorithm developed by Hassanieh et al. at MIT for Discrete Fourier Transforms on signals with a sparse frequency domain. A reference implementation of the algorithm exists and proves that the Sparse Fast Fourier Transform can be faster than modern FFT libraries. However, the reference implementation does not take advantage of modern hardware featur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2017
ISSN: 0377-0427
DOI: 10.1016/j.cam.2017.03.019